The Discrete Moment Problem with Nonconvex Shape Constraints
نویسندگان
چکیده
The discrete moment problem aims to find a worst-case distribution that satisfies given set of moments. This paper studies the problems with additional shape constraints guarantee is either log-concave (LC) or has an increasing failure rate (IFR) generalized (IGFR). These classes are useful in practice, applications revenue management, reliability, and inventory control. authors characterize structure optimal extreme point distributions show, for example, solution m moments LC piecewise geometric at most pieces. Using this optimality structure, they design exact algorithm computing solutions low-dimensional space parameters. leverage study robust newsvendor compute solutions.
منابع مشابه
Stability Of Unilateral Problem With Nonconvex Constraints∗
In this paper, we focuses on stability, asymptotical stability and finite-time stability for a class of differential inclusions governed by a nonconvex superpotential. This problem is known by "evolution hemivariational inequalities". After proposing an existence result of solutions, we give the stability results in terms of smooth Lyapunov functions subjected to some conditions described in te...
متن کاملEstimating Value at Risk by the Discrete Moment Problem
The purpose of this paper is to present a method for estimating the value at risk for portfolios consisting of (not necessarily independent) assets with lognormal distribution. Our approach is based on the fact that while the actual distribution of the value of the portfolio might not be known its moments can still be computed. These moments can be used to derive a set of linear constraints on ...
متن کاملNonconvex Robust Optimization for Problems with Constraints
W propose a new robust optimization method for problems with objective functions that may be computed via numerical simulations and incorporate constraints that need to be feasible under perturbations. The proposed method iteratively moves along descent directions for the robust problem with nonconvex constraints and terminates at a robust local minimum. We generalize the algorithm further to m...
متن کاملA Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints
Abstract. In this paper a barrier function method is proposed for approximating a solution of the nonconvex quadratic programming problem with box constraints. The method attempts to produce a solution of good quality by following a path as the barrier parameter decreases from a sufficiently large positive number. For a given value of the barrier parameter, the method searches for a minimum poi...
متن کاملOn Nonconvex Quadratic Programming with Box Constraints
Non-Convex Quadratic Programming with Box Constraints is a fundamental NP-hard global optimisation problem. Recently, some authors have studied a certain family of convex sets associated with this problem. We prove several fundamental results concerned with these convex sets: we determine their dimension, characterise their extreme points and vertices, show their invariance under certain affine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2021
ISSN: ['1526-5463', '0030-364X']
DOI: https://doi.org/10.1287/opre.2020.1990